ar X iv : m at h / 03 04 06 5 v 1 [ m at h . G R ] 4 A pr 2 00 3 On approximation of topological groups by finite algebraic systems . II

نویسندگان

  • L. Yu. Glebsky
  • E. I. Gordon
  • C. J. Rubio
چکیده

Recall that a locally compact group G is called unimodular if the left Haar measure on G is equal to the right one. It is proved in this paper that G is unimodular iff it is approximable by finite quasigroups (Latin squares).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : m at h / 04 11 06 2 v 1 [ m at h . O A ] 3 N ov 2 00 4 On automorphisms of type II Arveson systems ( probabilistic approach )

A counterexample to the conjecture that the automorphisms of an arbitrary Arveson system act transitively on its normalized units.

متن کامل

ar X iv : m at h / 06 04 35 4 v 1 [ m at h . A G ] 1 6 A pr 2 00 6 ENLARGEMENTS OF SCHEMES

In this article we use our constructions from [BS05] to lay down some foundations for the application of A. Robinson's nonstandard methods to modern Algebraic Geometry. The main motivation is the search for another tool to transfer results from characteristic zero to positive characteristic and vice versa. We give applications to the resolution of singularities and weak factorization.

متن کامل

ar X iv : m at h / 05 04 55 2 v 1 [ m at h . N T ] 2 7 A pr 2 00 5 Multiple logarithms , algebraic cycles and trees

This is a short exposition—mostly by way of the toy models " double logarithm " and " triple logarithm " —which should serve as an introduction to the article [3] in which we establish a connection between multiple polylogarithms, rooted trees and algebraic cycles.

متن کامل

ar X iv : h ep - p h / 06 04 03 2 v 1 4 A pr 2 00 6 A theoretical update on tt̄ production near threshold

We present an evaluation of the tt̄ cross section near threshold at next-to-next-to-leading logarithmic accuracy, using a two-step matching procedure. QED corrections are taken into account as well and are shown to be numerically important. Finally we give an outlook on how to further improve the theoretical predictions with particular emphasis on how to consistently include finite width effects.

متن کامل

ar X iv : m at h / 05 06 06 8 v 1 [ m at h . G R ] 3 J un 2 00 5 ALGORITHM FOR LANG ’ S THEOREM

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie type. We use an algorithm for computing a Chevalley basis for a split reductive Lie algebra, which is of independent interest.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003